Layered clusters of tightness set functions

نویسندگان

  • Boris G. Mirkin
  • Ilya B. Muchnik
چکیده

A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The method is based on the layered structure of the problem of maximization of a set function de ned as the minimum value of linkages between a set and its elements and referred to as the tightness function. When the linkage function is monotone, the layered cluster can be easily found with a greedy type algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forcing tightness in products of fans

We prove two theorems that characterize tightness in certain products of fans in terms of families of integer-valued functions. We also define several notions of forcing that allow us to manipulate the structure of the set of functions from some cardinal θ to ω, and hence, the tightness of these products. These results give new constructions of first countable <θ-cwH spaces that are not ≤θ-cwH.

متن کامل

Analytical D’Alembert Series Solution for Multi-Layered One-Dimensional Elastic Wave Propagation with the Use of General Dirichlet Series

A general initial-boundary value problem of one-dimensional transient wave propagation in a multi-layered elastic medium due to arbitrary boundary or interface excitations (either prescribed tractions or displacements) is considered. Laplace transformation technique is utilised and the Laplace transform inversion is facilitated via an unconventional method, where the expansion of complex-valued...

متن کامل

An Optimal iterative Minimal Spanning tree Clustering Algorithm for images

-Limited Spatial resolution, poor contrast, overlapping intensities, noise and intensity in homogeneities variation make the assignment of segmentation of medical images is greatly difficult. In recent days, mathematical algorithm supported automatic segmentation system plays an important role in clustering of imaging. The minimal spanning tree algorithm is capable of detecting clustering with ...

متن کامل

Optimum Ensemble Classification for Fully Polarimetric SAR Data Using Global-Local Classification Approach

In this paper, a proposed ensemble classification for fully polarimetric synthetic aperture radar (PolSAR) data using a global-local classification approach is presented. In the first step, to perform the global classification, the training feature space is divided into a specified number of clusters. In the next step to carry out the local classification over each of these clusters, which cont...

متن کامل

Comparison study between layered and functionally graded composite beams for static deflection and stress analyses

The aim of this paper is to compare the static deflections and stress results of layered and functionally graded composite beams under static load. In the comparison study, the results obtained for a cantilever beam under point load. The Timoshenko beam and the Euler-Bernoulli beam theories are used in the beam model. The energy based Ritz method is used for the solution of the problem and alge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Appl. Math. Lett.

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2002